翻訳と辞書 Words near each other ・ Boneh-ye Seyyed Mohammad Reza ・ Boneh-ye Sheykh Emamqoli ・ Boneh-ye Shir Mohammad ・ Boneh-ye Sib ・ Boneh-ye Sirun Char ・ Boneh-ye Sorkhi ・ Boneh-ye Sukhteh ・ Boneh-ye Sukhteh Char ・ Boneh-ye Sukhteh, Khuzestan ・ Boneh-ye Teymur ・ Boneh-ye Zamin, Gilan ・ Boneh-ye Zangar ・ Boneh-ye Zolfaqar ・ Bonehead ・ Bonehead (band) ・ Boneh–Franklin scheme ・ Boneh–Lynn–Shacham ・ Bonei Olam ・ Bonekickers ・ Bonel Balingit ・ Boneland ・ Boneless ・ Boneless (song) ・ Boneless Children Foundation ・ Boneless Fish ・ Bonelli ・ Bonelli House ・ Bonelli Landing, Lake Mead ・ Bonelli River ・ Bonelli's eagle Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Boneh–Franklin scheme ： ウィキペディア英語版 Boneh–Franklin scheme The Boneh–Franklin scheme is an identity-based encryption system proposed by Dan Boneh and Matthew K. Franklin in 2001.〔Dan Boneh, Matthew K. Franklin, "Identity-Based Encryption from the Weil Pairing", ''Advances in Cryptology - Proceedings of CRYPTO 2001'' (2001)〕 This article refers to the protocol version called BasicIdent. It is an application of pairings (Weil pairing) over elliptic curves and finite fields. ==Groups and parameters== As the scheme bases upon pairings, all computations are performed in two groups, $\backslash textstyle\; G\_1$ and $\backslash textstyle\; G\_2$: For $\backslash textstyle\; G\_1$, let $\backslash textstyle\; p$ be prime, $\backslash textstyle\; p\; \backslash equiv\; 2\; \backslash mod\; 3$ and consider the elliptic curve $\backslash textstyle\; E:\; y^2\; =\; x^3\; +\; 1$ over $\backslash textstyle\; \backslash mathbb/p\backslash mathbb$. Note that this curve is not singular as $\backslash textstyle\; 4a^3+27b^2\; =\; 27\; =\; 3^3$ only equals $\backslash textstyle\; 0$ for the case $\backslash textstyle\; p\; =\; 3$ which is excluded by the additional constraint. Let $\backslash textstyle\; q\; >\; 3$ be a prime factor of $\backslash textstyle\; p\; +\; 1$ (which is the order of $\backslash textstyle\; E$) and find a point $\backslash textstyle\; P\; \backslash in\; E$ of order $\backslash textstyle\; q$. $\backslash textstyle\; G\_1$ is the set of points generated by $\backslash textstyle\; P$: $\backslash textstyle\; \backslash left\backslash$ $\backslash textstyle\; G\_2$ is the subgroup of order $\backslash textstyle\; q$ of $\backslash textstyle\; GF\backslash left(p^2\backslash right)^$ *. We do not need to construct this group explicitly (this is done by the pairing) and thus don't have to find a generator. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Boneh–Franklin scheme」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.